An NL-Complete Puzzle
نویسنده
چکیده
We investigate the complexity of a puzzle that turns out to be NLcomplete.
منابع مشابه
Introducing an Invention: Puzzle Shaped Cast for Upper Limb Fractures
Upper limb fractures are prevalent injuries. An essential element of fracture healing is to maintain the bones alignment. However there are lots of complications associated with traditional ways of treatment, such as compartment syndrome and stiffness due to immobility for long time. Also evaluation and observation of the limb under the casts for potential infections and skin issues are n...
متن کاملCorrectness of Multiplicative (and Exponential) Proof Structures is NL -Complete
We provide a new correctness criterion for unit-free MLL proof structures and MELL proof structures with units. We prove that deciding the correctness of a MLL and of a MELL proof structure is NL-complete. We also prove that deciding the correctness of an intuitionistic multiplicative essential net is NL-complete.
متن کاملAdding Relations in Multi-levels to an Organization Structure of a Complete Binary Tree Maximizing Total Shortening Path Length
This paper proposes a model of adding relations in multi-levels to an organization structure which is a complete binary tree such that the communication of information between every member in the organization becomes the most efficient. When edges between every pair of nodes with the same depth in L (L = 1, 2, · · · , H ) levels are added to a complete binary tree of height H, an optimal set of...
متن کاملLanguage Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete
We prove that deciding language equivalence of deterministic realtime one-counter automata is NL-complete, in stark contrast to the inclusion problem which is known to be undecidable. This yields a subclass of deterministic pushdown automata for which the precise complexity of the equivalence problem can be determined. Moreover, we show that deciding regularity is NL-complete as well.
متن کاملOn the Power of Isolation in Planar Structures
The purpose of this paper is to study the deterministic isolation for certain structures in directed and undirected planar graphs. The motivation behind this work is a recent development on this topic. For example, [BTV 07] isolate a directed path in planar graphs and [DKR 08] isolate a perfect matching in bipartite planar graphs. One natural question raised by their work is: “How far is the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1507.02723 شماره
صفحات -
تاریخ انتشار 2015